Non-clausal Resolution Theorem Proving for Fuzzy Predicate Logic
نویسنده
چکیده
The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without the need of skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constructed it provides the deductive system, where existing resolution strategies and its implementations may be used with some limitations arising from specific properties of the FPL.
منابع مشابه
Non-clausal Resolution Theorem Proving for Description Logic
The article presents refutational resolution theorem proving system for Description Logic (DL) based on general (non-clausal) resolution rule. There is also presented unification algorithm handling existentiality without the need of skolemization in first-order logic. Its idea follows from general resolution with existentiality for first-order logic. When the prover is constructed it provides t...
متن کاملResolution Strategies for Fuzzy Description Logic
The paper presents experimental comparison of several resolution strategies for reasoning in Fuzzy Description Logic based on Fuzzy Predicate Logic with evaluated syntax. Resolutionbased reasoning is established on previous works concerning non-clausal resolution principle both theoretical and application-oriented (FPLGERDS inference engine).
متن کاملNon-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic
This paper introduces a non-clausal connection calculus for intuitionistic first-order logic. It is an extension of the non-clausal connection calculus for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic. nanoCoP-i is a first implementation of this intuitionistic non-clausal connection calculus. Details of the compact P...
متن کاملResolution Principle and Fuzzy Logic
Fuzzy Predicate Logic with Evaluated Syntax (FPL) (Novák, V.) is a well-studied and wide-used logic capable of expressing vagueness. It has a lot of applications based on robust theoretical background. It also requires an efficient formal proof theory. However the most widely applied resolution principle (Dukić, N.) brings syntactically several obstacles mainly arising from normal form transfor...
متن کاملRefutational Theorem Proving Using Term-Rewriting Systems
In this paper we propose a new approach to theorem proving in first-order logic based on the term-rewriting method. First for propositional calculus, we introduce a canonical term-rewriting system for Boolean algebra. This system enables us to transform the first-order predicate calculus into a form of equational logic, and to develop several complete strategies (both clausal and nonclausal) fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005